Model Generation Style Completeness Proofs for Constraint Tableaux with Superposition
نویسنده
چکیده
We present several calculi that integrate equality handling by superposition and ordered paramodulation into a free variable tableau calculus. We prove completeness of this calculus by an adaptation of themodel generation [1, 13] technique commonly used for completeness proofs of resolution calculi. The calculi and the completeness proof are compared to earlier results of Degtyarev and Voronkov [8].
منابع مشابه
A Model Generation Style Completeness Proof for Constraint Tableaux with Superposition
We present a calculus that integrates equality handling by superposition into a free variable tableau calculus. We prove completeness of this calculus by an adaptation of the model generation [1, 15] technique commonly used for completeness proofs of resolution calculi. The calculi and the completeness proof are compared to earlier results of Degtyarev and Voronkov [7].
متن کاملHyper Tableaux with Equality
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition inference rule, where equations used for paramodulation are drawn (only) from a set of positive unit ...
متن کاملConstraint Tableaux for Hybrid Logics Draft
Hybrid logics are modal logics with names for worlds. Tableau systems for various hybrid logics were proposed in [6, 7, 20]. We present an improved tableau system for hybrid logic that handles equality for nominals by substitution and generation of inequality constraints. This compiles out the equalities while storing the inequalities, thus allowing for efficient equality reasoning. The proof p...
متن کاملThe Hyper Tableaux Calculus with Equality and an Application to Finite Model Computation
In most theorem proving applications, a proper treatment of equational theories or equality is mandatory. In this paper we show how to integrate a modern treatment of equality in the hyper tableau calculus. It is based on splitting of positive clauses and an adapted version of the superposition inference rule, where equations used for superposition are drawn (only) from a set of positive unit c...
متن کاملA New Approach to Ordered Chaining
We present a new method for proving completeness of ordered chaining calculi for resolution-based rst-order reasoning with transitive relations. Previously, chaining rules were postulated and a posteriori ver-iied in semantic completeness proofs. We synthesize the rules from the transitivity axiom. Completeness of our calculi then follows from cor-rectness of their construction. Our method yiel...
متن کامل